Radio Mean Labeling of Some Splitting Graphs
نویسندگان
چکیده
Let G = (V, E) be a simple graph with p vertices and q edges. For connected of diameter d, radio mean labeling is one to mapping f from V(G) N satisfying the condition for every μ, ν ∈ V (G). The span maximum integer that maps vertex G. number G, rmn(G) lowest taken over all labelings In this paper, we analyze some splitting graphs labeling.
منابع مشابه
Further results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملRadio Labeling of Some Ladder-related Graphs∗
Let d(u, v) denote the distance between two distinct vertices of a connected graph G, and diam(G) be the diameter of G. A radio labeling c of G is an assignment of positive integers to the vertices ofG satisfying d(u, v)+|c(u)−c(v)| ≥ diam(G)+1 for every two distinct vertices u, v. The maximum integer in the range of the labeling is its span. The radio number of G, rn(G), is the minimum possibl...
متن کاملOn Radio Mean Number of Some Graphs
A radio mean labeling of a connected graph G is a one to one map f from the vertex set V (G) to the set of natural numbers N such that for each distinct vertices u and v of G, d (u, v)+ ⌈ f(u)+f(v) 2 ⌉ ≥ 1+ diam (G). The radio mean number of f , rmn (f), is the maximum number assigned to any vertex of G.The radio mean number of G, rmn (G) is the minimum value of rmn (f) taken over all radio mea...
متن کاملfurther results on odd mean labeling of some subdivision graphs
let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defi ned by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...
متن کاملFurther results on total mean cordial labeling of graphs
A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: ['1742-6588', '1742-6596']
DOI: https://doi.org/10.1088/1742-6596/1947/1/012011